A Refinement on the Growth Factor in Gaussian Elimination for Accretive-dissipative Matrices
نویسنده
چکیده
In this note, we give a refinement of the growth factor in Gaussian elimination for accretive-dissipative matrix A which is due to Lin [Calcolo, 2013, DOI 10.1007/s10092-013-0089-1].
منابع مشابه
On the growth factor in Gaussian elimination for generalized Higham matrices
The generalized Higham matrix is a complex symmetric matrix A = B + iC, where both B ∈ Cn×n and C ∈ Cn×n are Hermitian positive definite, and i = √−1 is the imaginary unit. The growth factor in Gaussian elimination is less than 3 √ 2 for this kind of matrices. In this paper, we give a new brief proof on this result by different techniques, which can be understood very easily, and obtain some ne...
متن کاملLarge growth factors in Gaussian elimination with pivoting
The growth factor plays an important role in the error analysis of Gaussian elimination. It is well known that when partial pivoting or complete pivoting is used the growth factor is usually small, but it can be large. The examples of large growth usually quoted involve contrived matrices that are unlikely to occur in practice. We present real and complex n n matrices arising from practical app...
متن کاملStability of a Pivoting Strategy for Parallel Gaussian Elimination
Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μn < 3 n−1, as compared to 2n−1 for the standard partial pivoting. This bound μ...
متن کاملAverage - Case Stability of Gaussian Elimination 337
Gaussian elimination with partial pivoting is unstable in the worst case: the "growth factor" can be as large as 2"-l, where n is the matrix dimension, resulting in a loss of n bits of precision. It is proposed that an average-case analysis can help explain why it is nevertheless stable in practice. The results presented begin with the observation that for many distributions of matrices, the ma...
متن کاملGaussian elimination
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of the most important and ubiquitous numerical algorithms. However, its successful use relies on understanding its numerical stability properties and how to organize its computations for efficient execution on modern computers. We give an overview of GE, ranging from theory to computation. We explai...
متن کامل